Join processing in unbounded spatial data streams
نویسندگان
چکیده
منابع مشابه
P2P Join Query Processing over Data Streams
De nombreuses applications distribuées partagent la même nécessité de traiter des flux de données de façon continue, par ex. la surveillance de réseau ou la gestion de réseaux de capteurs. Dans ce contexte, un problème important et difficile concerne le traitement de requêtes continues de jointure qui nécessite de maintenir une fenêtre glissante sur les données la plus grande possible, afin de ...
متن کاملA Survey of Join Processing in Data Streams
1. Introduction Given the fundamental role played by joins in querying relational databases, it is not surprising that stream join has also been the focus of much research on streams. Recall that relational (theta) join between two non-streaming relations R1 and R2, denoted RlweR2, returns thesetofallpairs (rl, r2), whererl E R1, 7-2 E R2, and the join condition 8(rl, r2) evaluates to true. A s...
متن کاملMultilevel Data Clustering for Spatial Join Processing
Thc spatial join is a cuminon spalid query typc that requires n high processing cost due lo thc largc volume of spatial detil and the computntion-iiitcnsivc spatial opcrntions [ I , 12, 13, 141. A spalial join consists in testing cvcry two possible pairs of objects hdoinging to two spatia? daln sets against n spalial predicatc [ 1 I ] . This prcdicnte might be flveriiip, cross, wilhiit distaric...
متن کاملData Redundancy and Duplicate Detection in Spatial Join Processing
The Partitioned Based Spatial-Merge Join (PBSM) of Patel and DeWitt and the Size Separation Spatial Join (S3J) of Koudas and Sevcik are considered to be among the most efficient methods for processing spatial (intersection) joins on two or more spatial relations. Both methods do not assume the presence of pre-existing spatial indices on the relations. In this paper, we propose several improveme...
متن کاملGreedyDual-Join: Locality-Aware Buffer Management for Approximate Join Processing Over Data Streams
We investigate adaptive buffer management techniques for approximate evaluation of sliding window joins over multiple data streams. In many applications, data stream processing systems have limited memory or have to deal with very high speed data streams. In both cases, computing the exact results of joins between these streams may not be feasible, mainly because the buffers used to compute the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2020
ISSN: 1877-0509
DOI: 10.1016/j.procs.2020.07.035